An Equational Axiomatization for Multi-exit Iteration
نویسندگان
چکیده
منابع مشابه
An Equational Axiomatization for Multi-Exit Iteration
This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multi-exit iteration. Multiexit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 def = P1X2 +Q1...
متن کاملA Complete Equational Axiomatization for Preex Iteration
Preex iteration a x is added to Minimal Process Algebra (MPA), which is a subalgebra of BPA equivalent to Milner's basic CCS. We present a-nite equational axiomatization for MPA , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have the sam...
متن کاملA Complete Equational Axiomatization for Prefix Iteration
Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have...
متن کاملA Complete Equational Axiomatization for MPA with String Iteration
We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner’s basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation p∗q obtained by restricting the first argument to be a non-empty sequence of atomic actions. We show that, for every positive integer k, bisimulation equivalenc...
متن کاملA Complete Equational Axiomatization for Bpa with Preex Iteration
Preex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a nite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2645